Adaptive memory search for Boolean optimization problems

We describe a simple adaptive memory search method for Boolean Optimization Problems. The search balances the level of infeasibility against the quality of the solution, and uses a simple dynamic tabu search mechanism. Computational results on a portfolio of test problems taken from the literature are reported, showing very favorable results, both in terms of search speed and solution quality.